16 research outputs found
Multiple Scale-Free Structures in Complex Ad-Hoc Networks
This paper develops a framework for analyzing and designing dynamic networks
comprising different classes of nodes that coexist and interact in one shared
environment. We consider {\em ad hoc} (i.e., nodes can leave the network
unannounced, and no node has any global knowledge about the class identities of
other nodes) {\em preferentially grown networks}, where different classes of
nodes are characterized by different sets of local parameters used in the
stochastic dynamics that all nodes in the network execute. We show that
multiple scale-free structures, one within each class of nodes, and with
tunable power-law exponents (as determined by the sets of parameters
characterizing each class) emerge naturally in our model. Moreover, the
coexistence of the scale-free structures of the different classes of nodes can
be captured by succinct phase diagrams, which show a rich set of structures,
including stable regions where different classes coexist in heavy-tailed and
light-tailed states, and sharp phase transitions. Finally, we show how the
dynamics formulated in this paper will serve as an essential part of {\em
ad-hoc networking protocols}, which can lead to the formation of robust and
efficiently searchable networks (including, the well-known Peer-To-Peer (P2P)
networks) even under very dynamic conditions
A Random Structure for Optimum Cache Size Distributed hash table (DHT) Peer-to-Peer design
We propose a new and easily-realizable distributed hash table (DHT)
peer-to-peer structure, incorporating a random caching strategy that allows for
{\em polylogarithmic search time} while having only a {\em constant cache}
size. We also show that a very large class of deterministic caching strategies,
which covers almost all previously proposed DHT systems, can not achieve
polylog search time with constant cache size. In general, the new scheme is the
first known DHT structure with the following highly-desired properties: (a)
Random caching strategy with constant cache size; (b) Average search time of
; (c) Guaranteed search time of ; (d) Truly local
cache dynamics with constant overhead for node deletions and additions; (e)
Self-organization from any initial network state towards the desired structure;
and (f) Allows a seamless means for various trade-offs, e.g., search speed or
anonymity at the expense of larger cache size.Comment: 13 pages, 2 figures, preprint versio
Let Your CyberAlter Ego Share Information and Manage Spam
Almost all of us have multiple cyberspace identities, and these {\em
cyber}alter egos are networked together to form a vast cyberspace social
network. This network is distinct from the world-wide-web (WWW), which is being
queried and mined to the tune of billions of dollars everyday, and until
recently, has gone largely unexplored. Empirically, the cyberspace social
networks have been found to possess many of the same complex features that
characterize its real counterparts, including scale-free degree distributions,
low diameter, and extensive connectivity. We show that these topological
features make the latent networks particularly suitable for explorations and
management via local-only messaging protocols. {\em Cyber}alter egos can
communicate via their direct links (i.e., using only their own address books)
and set up a highly decentralized and scalable message passing network that can
allow large-scale sharing of information and data. As one particular example of
such collaborative systems, we provide a design of a spam filtering system, and
our large-scale simulations show that the system achieves a spam detection rate
close to 100%, while the false positive rate is kept around zero. This system
has several advantages over other recent proposals (i) It uses an already
existing network, created by the same social dynamics that govern our daily
lives, and no dedicated peer-to-peer (P2P) systems or centralized server-based
systems need be constructed; (ii) It utilizes a percolation search algorithm
that makes the query-generated traffic scalable; (iii) The network has a built
in trust system (just as in social networks) that can be used to thwart
malicious attacks; iv) It can be implemented right now as a plugin to popular
email programs, such as MS Outlook, Eudora, and Sendmail.Comment: 13 pages, 10 figure